Worst Case Analysis of Non-local Games
نویسندگان
چکیده
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input xi to the i th player who then responds by sending an answer ai to the referee. The players win if the answers ai satisfy a condition that may depend on the inputs xi. Typically, non-local games are studied in a framework where the referee picks the inputs from a known probability distribution. We initiate the study of non-local games in a worst-case scenario when the referee’s probability distribution is unknown and study several non-local games in this scenario.
منابع مشابه
Complexity and Optimality of the Best Response Algorithm in Random Potential Games
In this paper we compute the worst-case and average execution time of the Best Response Algorithm (BRA) to compute a pure Nash equilibrium in finite potential games. Our approach is based on a Markov chain model of BRA and a coupling technique that transform the average execution time of this discrete algorithm into the solution of an ordinary differential equation. In a potential game with N p...
متن کاملAn Anthropological Study of Folk Plays and Games with Focus on Fooman Town in Gilan Province
Play and Game are considered as the oldest cultural behaviors as the universal elements of human culture in all communities and groups. Gilan province in Iran, especially their villages, has a unique folklore especially its local games and plays. Nevertheless, it is necessary to document and analyze the immense information about the folklore in these villages before it vanishes in the sea of so...
متن کاملLinear-Time Resource Allocation in Security Games with Identical Fully Protective Resources
Game theory has become an important tools for making resource allocations decision in security domains, including critical infrastructure protection. Many of these games are formulated as Stackelberg security games. We present new analysis and algorithms for a class of Stackelberg security games with identical, fully protective defender resources. The first algorithm has worst-case complexity l...
متن کاملLocal-Effect Games, and an Algorithm for Computing their Equilibria
There is much interest in modeling large, real-world problems as games and computing these games’ equilibria. This interest has driven recent advances in algorithms for computing Nash equilibria of general games. One recent, generalpurpose algorithm is the continuation method of Govindan and Wilson [2003], a gradient-following algorithm which is based on topological insight into the graph of th...
متن کاملLocal search techniques for computing equilibria in two-player general-sum strategic-form games
The computation of a Nash equilibrium in a game is a challenging problem in artificial intelligence. This is because the computational time of the algorithms provided by the literature is, in the worst case, exponential in the size of the game. To deal with this problem, it is common the resort to concepts of approximate equilibrium. In this paper, we follow a different route, presenting, to th...
متن کامل